Exam as an assessment instrument in computer programming courses: student perceptions

Assessment can take many forms, and it can be argued that the greater the diversity in the methods of assessment, the fairer, assessment is to students (Race 2007). The most effective form of assessment is one that appropriately examines the learning outcomes of the module. Assessment methods are also known to play an important role in how students learn (Brown 2004). The traditional assessment approach, in which one single written examination counts towards a student's total score, no longer meets new demands of programming language education (Wang, Li et al. 2012). Students tend to gain higher marks from coursework assignments than they do from examinations (Gibbs and Simpson, 2004). Students consider coursework to be fairer than exams, to measure a greater range of abilities than exams and to allow students to organize their own work patterns to a greater extent (Kniveton, 1996, cited in Gibbs and Simpson, 2004). Do students really hate exams? Are exams ineffective as an assessment approach in computer programming courses? A university wide research survey regarding assessment approaches in computer programming was conducted among students of undergraduate computing courses (including all three levels). 167 students participated in the survey. The author discusses some interesting results obtained from the survey. More than 50% of the students surveyed indicated that they would like examination to be a part of the assessment approach. The author explores possible reasons for this choice by students and compares these results with that of research conducted in other subject areas

Capture and Maintenance of Constraints in Engineering Design

The thesis investigates two domains, initially the kite domain and then part of a more demanding Rolls-Royce domain (jet engine design). Four main types of refinement rules that use the associated application conditions and domain ontology to support the maintenance of constraints are proposed. The refinement rules have been implemented in ConEditor and the extended system is known as ConEditor+. With the help of ConEditor+, the thesis demonstrates that an explicit representation of application conditions together with the corresponding constraints and the domain ontology can be used to detect inconsistencies, redundancy, subsumption and fusion, reduce the number of spurious inconsistencies and prevent the identification of inappropriate refinements of redundancy, subsumption and fusion between pairs of constraints.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Pile-up solutions for some systems of conservation laws modelling dislocation interaction in crystals

Some continuum models for dislocation interactions in a simple crystal geometry are studied. The simplest models are mixed systems of conservation laws which are shown to exhibit singularities and instabilities. These are then regularized, leading to parabolic free-boundary problems. In both cases, solutions describing the formation of structures such as dislocation pile-ups are discussed

An innovative web-based tool to solve group marking issues

Group/Team work is an important element in most (if not all) courses in higher level education. Assessment of group work has always been challenging with potential problems. Problems include inconsistent marking processes and potentially unfair scoring/grading methods. Our study reviewed group marking processes across several courses including software engineering, computing, business computing, web technology and security within one university. The key challenge faced by all is: “How can the marks from a lecturer and students within a group be combined in a fair way to produce a single score for each student?”. We discuss preliminary results of evaluating a tool that has been developed to tackle the above challenge

The role of ontologies in creating and maintaining corporate knowledge: a case study from the aero industry

The Designers’ Workbench is a system, developed to support designers in large organizations, such as Rolls-Royce, by making sure that the design is consistent with the specification for the particular design as well as with the company’s design rule book(s). The evolving design is described against a jet engine ontology. Currently, to capture the constraint information, a domain expert (design engineer) has to work with a knowledge engineer to identify the constraints, and it is then the task of the knowledge engineer to encode these into the Workbench’s knowledge base (KB). This is an error prone and time consuming task. It is highly desirable to relieve the knowledge engineer of this task, and so we have developed a tool, ConEditor+ that enables domain experts themselves to capture and maintain these constraints. The tool allows the user to combine selected entities from the domain ontology with keywords and operators of a constraint language to form a constraint expression. Further, we hypothesize that to apply constraints appropriately, it is necessary to understand the context in which each constraint is applicable. We refer to this as “application conditions”. We show that an explicit representation of application conditions, in a machine interpretable format, along with the constraints and the domain ontology can be used to support the verification and maintenance of constraints

Constraint capture and maintenance in engineering design

The Designers' Workbench is a system, developed by the Advanced Knowledge Technologies (AKT) consortium to support designers in large organizations, such as Rolls-Royce, to ensure that the design is consistent with the specification for the particular design as well as with the company's design rule book(s). In the principal application discussed here, the evolving design is described against a jet engine ontology. Design rules are expressed as constraints over the domain ontology. Currently, to capture the constraint information, a domain expert (design engineer) has to work with a knowledge engineer to identify the constraints, and it is then the task of the knowledge engineer to encode these into the Workbench's knowledge base (KB). This is an error prone and time consuming task. It is highly desirable to relieve the knowledge engineer of this task, and so we have developed a system, ConEditor+ that enables domain experts themselves to capture and maintain these constraints. Further we hypothesize that in order to appropriately apply, maintain and reuse constraints, it is necessary to understand the underlying assumptions and context in which each constraint is applicable. We refer to them as “application conditions” and these form a part of the rationale associated with the constraint. We propose a methodology to capture the application conditions associated with a constraint and demonstrate that an explicit representation (machine interpretable format) of application conditions (rationales) together with the corresponding constraints and the domain ontology can be used by a machine to support maintenance of constraints. Support for the maintenance of constraints includes detecting inconsistencies, subsumption, redundancy, fusion between constraints and suggesting appropriate refinements. The proposed methodology provides immediate benefits to the designers and hence should encourage them to input the application conditions (rationales)

Exam as an assessment instrument in computer programming courses

Assessment can take many forms, and it can be argued that the greater the diversity in the methods of assessment, the fairer, assessment is to students (Race 2007). The most effective form of assessment is one that appropriately examines the learning outcomes of the module. Assessment methods are also known to play an important role in how students learn (Brown 2004). The traditional assessment approach, in which one single written examination counts towards a student's total score, no longer meets new demands of programming language education (Wang, Li et al. 2012). Students tend to gain higher marks from coursework assignments than they do from examinations (Gibbs and Simpson, 2004). Students consider coursework to be fairer than exams, to measure a greater range of abilities than exams and to allow students to organize their own work patterns to a greater extent (Kniveton, 1996, cited in Gibbs and Simpson, 2004). Do students really hate exams? Are exams ineffective as an assessment approach in computer programming courses? A university wide research survey regarding assessment approaches in computer programming was conducted among students of undergraduate computing courses (including all three levels). 167 students participated in the survey. The author discusses some interesting results obtained from the survey. More than 50% of the students surveyed indicated that they would like examination to be a part of the assessment approach. The author explores possible reasons for this choice by students and compares these results with that of research conducted in other subject areas

ConEditor+: Capture and Maintenance of Constraints in Engineering Design

The Designers' Workbench is a system, developed to support designers in large organizations, such as Rolls-Royce, by making sure that the design is consistent with the specification for the particular design as well as with the company’s design rule book(s). Currently, to capture the constraint information, a domain expert (design engineer) has to work with a knowledge engineer to identify the constraints, and it is then the task of the knowledge engineer to encode these into the Workbench's knowledge base (KB). This is an error prone and time consuming task. It is highly desirable to relieve the knowledge engineer of this task, and so we have developed a tool, ConEditor+ that enables domain experts themselves to capture and maintain these constraints. The tool allows the user to combine selected entities from the domain ontology with keywords and operators of a constraint language to form a constraint expression. Further, we hypothesize that to apply constraints appropriately, it is necessary to understand the context in which each constraint is applicable. We refer to this as "application conditions". We show that an explicit representation of application conditions, in a machine interpretable format, along with the constraints and the domain ontology can be used to support the verification and maintenance of constraints